Graph cuts with interacting edge weights: examples, approximations, and algorithms
نویسندگان
چکیده
منابع مشابه
Graph cuts with interacting edge weights: examples, approximations, and algorithms
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperati...
متن کاملGraph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperati...
متن کاملCooperative Cuts: Graph Cuts with Submodular Edge Weights
We introduce a problem we call Cooperative cut, where the goal is to find a minimum-cost graph cut but where a submodular function is used to define the cost of a subsets of edges. That means, the cost of an edge that is added to the current cut set C depends on the edges in C. This generalization of the cost in the standard min-cut problem to a submodular cost function immediately makes the pr...
متن کاملNotes on graph cuts with submodular edge weights
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately makes the problem harder. Not only do we prove NP hardness even for nonnegative submodular costs, but also show a lower bound of Ω(|V |) on the approximation factor for the (s, t) cut version of the problem. On the positive side, we propose and compare three approximation algorithms with an overall a...
متن کاملEdge preserving phase unwrapping using graph cuts
This paper addresses the problem of recovering the absolute phase from modulo-2π phase, the so-called phase unwrapping (PU) problem. PU is a key step in several imaging technologies, namely, interferometric synthetic aperture radar (InSAR), and interferometric synthetic aperture sonar (InSAS). There, the topographic information is encoded in the phase of a complex valued image with a (different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-1038-y